Daniel Paulusma: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

Golovach, Petr A., Johnson, Matthew, Paulusma, Daniël, Song, Jian

Journal:

Journal of Graph Theory

Year:

2016

Language:

english

File:

PDF, 472 KB

english, 2016

2

Algorithms for diversity and clustering in social networks through dot product graphs

Johnson, Matthew, Paulusma, Daniël, van Leeuwen, Erik Jan

Journal:

Social Networks

Year:

2015

Language:

english

File:

PDF, 521 KB

english, 2015

3

Computing solutions for matching games

Péter Biró, Walter Kern, Daniël Paulusma

Journal:

International Journal of Game Theory

Year:

2012

Language:

english

File:

PDF, 233 KB

english, 2012

4

Relative length of longest paths and longest cycles in triangle-free graphs

Daniel Paulusma, Kiyoshi Yoshimoto

Journal:

Discrete Mathematics

Year:

2008

Language:

english

File:

PDF, 215 KB

english, 2008

5

On the parameterized complexity of coloring graphs in the absence of a linear forest

Couturier, Jean-François, Golovach, Petr A., Kratsch, Dieter, Paulusma, Daniël

Journal:

Journal of Discrete Algorithms

Year:

2012

Language:

english

File:

PDF, 182 KB

english, 2012

6

Reducing the Chromatic Number by Vertex or Edge Deletions

Picouleau, Christophe, Paulusma, Daniël, Ries, Bernard

Journal:

Electronic Notes in Discrete Mathematics

Year:

2017

Language:

english

File:

PDF, 187 KB

english, 2017

7

Contraction and deletion blockers for perfect graphs and H -free graphs

Diner, Öznur Yaşar, Paulusma, Daniël, Picouleau, Christophe, Ries, Bernard

Journal:

Theoretical Computer Science

Year:

2018

Language:

english

File:

PDF, 1.41 MB

english, 2018

8

Effects of Edge Centrality on Random Walks on Graphs

Lin, Yuan, Zhang, Zhongzhi, Paulusma, Daniel

Journal:

The Computer Journal

Year:

2018

Language:

english

File:

PDF, 1.66 MB

english, 2018

9

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

Asaf Levin, Daniel Paulusma, Gerhard J. Woeginger

Journal:

Year:

2008

Language:

english

File:

PDF, 371 KB

english, 2008

10

The computational complexity of graph contractions II: Two tough polynomially solvable cases

Asaf Levin, Daniel Paulusma, Gerhard J. Woeginger

Journal:

Year:

2008

Language:

english

File:

PDF, 369 KB

english, 2008

11

Graph labelings derived from models in distributed computing: A complete complexity classification

Jérémie Chalopin, Daniël Paulusma

Journal:

Year:

2011

Language:

english

File:

PDF, 409 KB

english, 2011

12

A new characterization of -free graphs

Pim van ’t Hof, Daniël Paulusma

Journal:

Discrete Applied Mathematics

Year:

2010

Language:

english

File:

PDF, 859 KB

english, 2010

13

On disconnected cuts and separators

Takehiro Ito, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Journal:

Discrete Applied Mathematics

Year:

2011

Language:

english

File:

PDF, 238 KB

english, 2011

14

The computational complexity of the elimination problem in generalized sports competitions

Walter Kern, Daniël Paulusma

Journal:

Discrete Optimization

Year:

2004

Language:

english

File:

PDF, 217 KB

english, 2004

15

Locally constrained graph homomorphisms and equitable partitions

Jiří Fiala, Daniël Paulusma, Jan Arne Telle

Journal:

European Journal of Combinatorics

Year:

2008

Language:

english

File:

PDF, 806 KB

english, 2008

16

On components of 2-factors in claw-free graphs

Hajo Broersma, Daniel Paulusma, Kiyoshi Yoshimoto

Journal:

Electronic Notes in Discrete Mathematics

Year:

2007

File:

PDF, 334 KB

2007

17

Computing sharp 2-factors in claw-free graphs

Hajo Broersma, Daniël Paulusma

Journal:

Journal of Discrete Algorithms

Year:

2010

Language:

english

File:

PDF, 213 KB

english, 2010

18

Contracting planar graphs to contractions of triangulations

Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Journal:

Journal of Discrete Algorithms

Year:

2011

Language:

english

File:

PDF, 195 KB

english, 2011

19

A complete complexity classification of the role assignment problem

Jiří Fiala, Daniël Paulusma

Journal:

Theoretical Computer Science

Year:

2005

Language:

english

File:

PDF, 287 KB

english, 2005

20

The computational complexity of the parallel knock-out problem

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart

Journal:

Theoretical Computer Science

Year:

2008

Language:

english

File:

PDF, 460 KB

english, 2008

21

Partitioning graphs into connected parts

Pim van ’t Hof, Daniël Paulusma, Gerhard J. Woeginger

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 766 KB

english, 2009

22

Computing role assignments of chordal graphs

Pim van ’t Hof, Daniël Paulusma, Johan M.M. van Rooij

Journal:

Theoretical Computer Science

Year:

2010

Language:

english

File:

PDF, 475 KB

english, 2010

23

The new FIFA rules are hard: complexity aspects of sports competitions

Walter Kern, Daniël Paulusma

Journal:

Discrete Applied Mathematics

Year:

2001

Language:

english

File:

PDF, 100 KB

english, 2001

24

Note on the computational complexity of least core concepts for min-cost spanning tree games

Ulrich Faigle, Walter Kern, Daniël Paulusma

Journal:

Mathematical Methods of Operations Research

Year:

2000

Language:

english

File:

PDF, 129 KB

english, 2000

25

Comparing Universal Covers in Polynomial Time

Jiří Fiala, Daniël Paulusma

Journal:

Theory of Computing Systems

Year:

2010

Language:

english

File:

PDF, 506 KB

english, 2010

26

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto

Journal:

Graphs and Combinatorics

Year:

2009

Language:

english

File:

PDF, 617 KB

english, 2009

27

Finding Induced Paths of Given Parity in

Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma

Journal:

Year:

2012

Language:

english

File:

PDF, 891 KB

english, 2012

28

Thek-in-a-Path Problem for Claw-free Graphs

Jiří Fiala, Marcin Kamiński, Bernard Lidický, Daniël Paulusma

Journal:

Year:

2012

Language:

english

File:

PDF, 705 KB

english, 2012

29

Path factors and parallel knock-out schemes of almost claw-free graphs

Matthew Johnson, Daniël Paulusma, Chantal Wood

Journal:

Discrete Mathematics

Year:

2010

Language:

english

File:

PDF, 432 KB

english, 2010

30

Upper bounds and algorithms for parallel knock-out numbers

Hajo Broersma, Matthew Johnson, Daniël Paulusma

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 627 KB

english, 2009

31

Covering graphs with few complete bipartite subgraphs

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 665 KB

english, 2009

32

Distance three labelings of trees

Jiří Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 496 KB

english, 2012

33

On graph contractions and induced minors

Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 386 KB

english, 2012

34

Containment relations in split graphs

Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 289 KB

english, 2012

35

Editorial

Iain A. Stewart, Daniel Paulusma, Matthew Johnson

Journal:

Journal of Discrete Algorithms

Year:

2012

Language:

english

File:

PDF, 68 KB

english, 2012

36

Computing role assignments of proper interval graphs in polynomial time

Pinar Heggernes, Pim van ʼt Hof, Daniël Paulusma

Journal:

Journal of Discrete Algorithms

Year:

2012

Language:

english

File:

PDF, 385 KB

english, 2012

37

On partitioning a graph into two connected subgraphs

Daniël Paulusma, Johan M.M. van Rooij

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 317 KB

english, 2011

38

Parameterizing cut sets in a graph by the number of their components

Takehiro Ito, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 317 KB

english, 2011

39

Updating the complexity status of coloring graphs without a fixed induced linear forest

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 330 KB

english, 2012

40

Induced packing of odd cycles in planar graphs

Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 286 KB

english, 2012

41

Determining the chromatic number of triangle-free -free graphs in polynomial time

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 283 KB

english, 2012

42

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 5344 || On Independent Sets and Bicliques in Graphs

Broersma, Hajo, Erlebach, Thomas, Friedetzky, Tom, Paulusma, Daniel

Year:

2008

Language:

english

File:

PDF, 236 KB

english, 2008

43

A New Algorithm for On-line Coloring Bipartite Graphs

Broersma, Hajo J., Capponi, Agostino, Paulusma, Daniël

Journal:

SIAM Journal on Discrete Mathematics

Year:

2008

Language:

english

File:

PDF, 271 KB

english, 2008

44

Finding vertex-surjective graph homomorphisms

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma

Journal:

Acta Informatica

Year:

2012

Language:

english

File:

PDF, 349 KB

english, 2012

45

4-coloring -free graphs when is small

Petr A. Golovach, Daniël Paulusma, Jian Song

Journal:

Discrete Applied Mathematics

Year:

2013

Language:

english

File:

PDF, 293 KB

english, 2013

46

Three complexity results on coloring -free graphs

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Journal:

European Journal of Combinatorics

Year:

2013

Language:

english

File:

PDF, 327 KB

english, 2013

47

Lift Contractions

Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Journal:

Electronic Notes in Discrete Mathematics

Year:

2011

Language:

english

File:

PDF, 208 KB

english, 2011

48

On the diameter of reconfiguration graphs for vertex colourings

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma

Journal:

Electronic Notes in Discrete Mathematics

Year:

2011

Language:

english

File:

PDF, 177 KB

english, 2011

49

Detecting induced star-like minors in polynomial time

Fiala, Jiří, Kamiński, Marcin, Paulusma, Daniël

Journal:

Journal of Discrete Algorithms

Year:

2012

Language:

english

File:

PDF, 277 KB

english, 2012

50

Computing vertex-surjective homomorphisms to partially reflexive trees

Golovach, Petr A., Paulusma, Daniël, Song, Jian

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 462 KB

english, 2012